Fundamental polygons
نویسندگان
چکیده
منابع مشابه
Fundamental Polygons by Maurice Heins
A group © satisfying the hypothesis of Siegel is necessarily of the first kind. The question arises whether there is a theorem of the Siegel type for © of the second kind. I t is one of the objects of the present investigation to establish such a theorem and to draw consequences of this result taken in conjunction with Siegel's theorem. The other object is to study the relation between the para...
متن کاملOn Poincaré’s Theorem for Fundamental Polygons
Poincaré’s classical theorem of fundamental polygons is a widely known, valuable tool that gives sufficient conditions for a (convex) hyperbolic polygon, equipped with so-called side-pairing transformations, to be a fundamental domain for a discrete subgroup of isometries. Poincaré first published the theorem in dimension two in 1882. In the past century, there have been several published proof...
متن کاملExamensarbete Algorithmic Construction of Fundamental Polygons for Certain Fuchsian Groups
The work of mathematical giants, such as Lobachevsky, Gauss, Riemann, Klein and Poincaré, to name a few, lies at the foundation of the study of the highly structured Riemann surfaces, which allow definition of holomorphic maps, corresponding to analytic maps in the theory of complex analysis. A topological result of Poincaré states that every path-connected Riemann surface can be realised by a ...
متن کاملDissections of Polygons into Convex Polygons
In the paper we present purely combinatorial conditions that allow us to recognize the topological equivalence (or non-equivalence) of two given dissections. Using a computer program based on this result, we are able to generate a set which contains all topologically non-equivalent dissections of a p0-gon into convex pi-gons, i = 1, ..., n, where n, p0, ..., pn are integers such that n ≥ 2, pi ...
متن کاملGuarding Fat Polygons and Triangulating Guarded Polygons
In this paper we study three related problems: (i) Given a fat polygon P , we show how to find a set G of points in P such that every point on the boundary of P sees at least one point of G. The set G is said to guard the boundary of P and its cardinality depends on the shape parameters of P . Fat polygons are often used to model more realistic inputs. (ii) Given k points that guard the boundar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1963
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1963-11021-6